Generalized DNA Barcode Design Based on Hamming Codes
نویسندگان
چکیده
منابع مشابه
Generalized DNA Barcode Design Based on Hamming Codes
The diversity and scope of multiplex parallel sequencing applications is steadily increasing. Critically, multiplex parallel sequencing applications methods rely on the use of barcoded primers for sample identification, and the quality of the barcodes directly impacts the quality of the resulting sequence data. Inspection of the recent publications reveals a surprisingly variable quality of the...
متن کاملRelative generalized Hamming weights of cyclic codes
Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...
متن کاملGeneralized Hamming weights for linear codes
Error control codes are widely used to increase the reliability of transmission of information over various forms of communications channels. The Hamming weight of a codeword is the number of nonzero entries in the word; the weights of the words in a linear code determine the error-correcting capacity of the code. The rth generalized Hamming weight for a linear code C, denoted by dr(C), is the ...
متن کاملOn the generalized Hamming weights of convolutional codes
Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...
متن کاملRelative generalized Hamming weights of $q$-ary Reed-Muller codes
Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0036852